Behavioral Mechanism Design: Optimal Contests for Simple Agents

نویسندگان

  • Arpita Ghosh
  • Robert D. Kleinberg
چکیده

Incentives are more likely to elicit desired outcomes when they are designed based on accurate models of agents’ strategic behavior. A growing literature, however, suggests that people do not quite behave like standard economic agents in a variety of environments, both online and offline. What consequences might such differences have for the optimal design of mechanisms in these environments? In this paper, we explore this question in the context of optimal contest design for simple agents—agents who strategically reason about whether or not to participate in a system, but not about the input they provide to it. Specifically, consider a contest where n potential contestants with types (qi, ci) each choose between participating and producing a submission of quality qi at cost ci, versus not participating at all, to maximize their utilities. How should a principal distribute a total prize V amongst the n ranks to maximize some increasing function of the qualities of elicited submissions in a contest with such simple agents? We first solve the optimal contest design problem for settings where agents have homogenous participation costs ci = c. Here, the contest that maximizes every increasing function of the elicited contributions is always a simple contest, awarding equal prizes of V/j∗ each to the top j∗ = V/c − Θ( √ V/(c ln(V/c))) contestants. This is in contrast with the optimal contest structure in comparable models with strategic effort choices, where the optimal contest is either a winner-take-all contest or awards possibly unequal prizes, depending on the curvature of agents’ effort cost functions. We next address the general case with heterogenous costs where agents’ types (qi, ci) are inherently twodimensional, significantly complicating equilibrium analysis. With heterogenous costs, the optimal contest depends on the objective being maximized: our main result here is that the winner-take-all contest is a 3-approximation of the optimal contest when the principal’s objective is to maximize the quality of the best elicited contribution. The proof of this result hinges around a ‘sub-equilibrium’ lemma establishing a stochastic dominance relation between the distribution of qualities elicited in an equilibrium and a sub-equilibrium—a strategy profile that is a best response for all agents who choose to participate in that strategy profile; this relation between equilibria and sub-equilibria may be of more general interest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Design of Crowdsourcing Contests

This paper provides a game theoretic model of a crowdsourcing contest. Special attention is given to the asymptotic behavior of the contest outcome. We show that all significant outcomes of crowdsourcing contests will be determined by contestants in a small neighborhood (core) of the most efficient contestant type; in particular, the asymptotic structure of the crowdsourcing contests is distrib...

متن کامل

Simple vs Optimal Contests with Convex Costs

We study an optimal contest design problem where contributors abilities are private, their costs are convex as a function of their e‚ort, and the designer seeks to maximize their total e‚ort. We address the design of approximately optimal mechanisms that are robust in that they are independent of the ability distribution and the precise form of the cost function. We show that a very simple all-...

متن کامل

Markets for Ideas: Prize Structure, Entry Limits, and the Design of Ideation Contests

Contests are a popular mechanism for the procurement of innovation. In marketing, design, and other creative industries, firms use freelance marketplaces to organize contests and obtain high-quality ideas for ads, new products, and even business strategies from participants. A central question faced by contest sponsors is how to appropriately structure prizes and entry regulations. I develop an...

متن کامل

Optimal crowdsourcing contests

We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to enter. Unlike all-pay auctions where a usual design objective would be to maximize revenue, in crowdsourcing contests, the principal only benefits from the submission with the highest quality. We give a theory for optim...

متن کامل

The Crowdsourcer’s Dilemma: Design and Efficiency of All-Pay Contests with Incomplete Information

Contests are frequently adopted to procure goods and services for which spot markets do not exist, contracts are incomplete and outcomes cannot be verified in a court. With the rapid evolution of the Internet and the Web, a new generation of procurement contests has emerged. A number of companies run Web-based competitions in which contestants develop and submit ideas or products, and prizes ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1406.1790  شماره 

صفحات  -

تاریخ انتشار 2014